Global Behavior of Deconvolution Kernel Estimates
نویسنده
چکیده
The desire to recover the unknown density when data are contaminated with errors leads to nonparametric deconvolution problems. The difficulty of deconvolution depends on both the smoothness of error distribution and the smoothness of the priori. Under a general class of smoothness constraints, we show that deconvolution kernel density k-l estimates achieve the best attainable global rates of convergence n 2(kH)+1 under L p (1 ~ p < 00) norm, where I is the order of the derivative function of the unknown density to be estimated, k is the degrees of smoothness constraints, and {3 is the degree of the smoothness of the error distribution. Our results indicate that in present of errors, the bandwidth should be chosen larger than the ordinary density estimate. These results also constitute an extension of the ordinary kernel density estimates. oAbbreviated title: global rates of deconvolution. AMS 1980 subject classification. Primary 62G20. Secondary 62G05.
منابع مشابه
Deconvolution with Supersmooth Distributions
The desire to recover the unknown density when data are contaminated with errors leads to nonparametric deconvolution problems. Optimal global rates of convergence are found under the weighted Lp-loss (1 $ p $ 00). It appears that the optimal rates of convergence are extremely slow for supersmooth error distributions. To overcome the difficulty, we examine how large the noise level can be for d...
متن کاملA Neural Approach to Blind Motion Deblurring
We present a new method for blind motion deblurring that uses a neural network trained to compute estimates of sharp image patches from observations that are blurred by an unknown motion kernel. Instead of regressing directly to patch intensities, this network learns to predict the complex Fourier coefficients of a deconvolution filter to be applied to the input patch for restoration. For infer...
متن کاملAsymptotic Normality of Nonparametric Kernel Type Deconvolution Density Estimators: crossing the Cauchy boundary
We derive asymptotic normality of kernel type deconvolution density estimators. In particular we consider deconvolution problems where the known component of the convolution has a symmetric λ-stable distribution, 0 < λ ≤ 2. It turns out that the limit behavior changes if the exponent parameter λ passes the value one, the case of Cauchy deconvolution. AMS classification: primary 62G05; secondary...
متن کاملBlind Deconvolution of Bar Code Signals
Abstract Bar code reconstruction involves recovering a clean signal from an observed one that is corrupted by convolution with a kernel and additive noise. The precise form of the convolution kernel is also unknown, making reconstruction harder than in the case of standard deblurring. On the other hand, bar codes are functions that have a very special form – this makes reconstruction feasible. ...
متن کاملLocal bandwidth selectors for deconvolution kernel density estimation
We consider kernel density estimation when the observations are contaminated by measurement errors. It is well known that the success of kernel estimators depends heavily on the choice of a smoothing parameter called the bandwidth. A number of data-driven bandwidth selectors exist in the literature, but they are all global. Such techniques are appropriate when the density is relatively simple, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1989